On Generalized Communicating P Systems with One Symbol

Generalized communicating P systems (GCPSs) are purely communicating tissue-like membrane systems with rules for moving pairs of objects. Despite their simplicity, these systems are rather powerful, they are able to generate any recursively enumerable set of numbers even having restricted variants of communication rules. In this paper we show that GCPSs still remain computationally complete if they are given with a singleton alphabet of objects and with one of the restricted types of rules parallel-shift, join, presence-move, and chain.